Higher dimensional diophantine problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher Dimensional Diophantine Problems

1. Rational points. A classical conjecture of Mordell states that a curve of genus ^ 2 over the rational numbers has only a finite number of rational points. Let K be a finitely generated field over the rational numbers. Then the same statement should hold for a curve defined over K, and a specialization argument due to Néron shows in fact that this latter statement is implied by the correspond...

متن کامل

Open Diophantine Problems

Diophantine Analysis is a very active domain of mathematical research where one finds more conjectures than results. We collect here a number of open questions concerning Diophantine equations (including Pillai’s Conjectures), Diophantine approximation (featuring the abc Conjecture) and transcendental number theory (with, for instance, Schanuel’s Conjecture). Some questions related to Mahler’s ...

متن کامل

Cyclic Scheduling and Diophantine Problems

Cyclic scheduling concerns both kinds of questions following the deductive and inductive ways of reasoning. First class of problems concentrates on rules aimed at resources assignment as to minimize a given objective function, e.g. the cycle time, the flow time of a job. In turn, the second class focuses on a system structure designing as to guarantee the assumed qualitative and/or quantitative...

متن کامل

RSA and a higher degree diophantine equation

Let N = pq be an RSA modulus, i.e the product of two large primes p and q. Without loss of generality, we assume that q < p. Morever, throughout this paper we assume that the primes p and q are balanced, in other words, that the bitsizes of the primes are equal so that q < p < 2q. Let e, d be the public and secret exponents satisfying ed ≡ 1 (mod φ(n)) where φ(n) = (p−1)(q−1) is the Euler totie...

متن کامل

Sparse grids and related approximation schemes for higher dimensional problems

The efficient numerical treatment of high-dimensional problems is hampered by the curse of dimensionality. We review approximation techniques which overcome this problem to some extent. Here, we focus on methods stemming from Kolmogorov’s theorem, the ANOVA decomposition and the sparse grid approach and discuss their prerequisites and properties. Moreover, we present energy-norm based sparse gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1974

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1974-13516-0